منابع مشابه
Girth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملSome special minimum k-geodetically connected graphs
A connected graph G is k-geodetically connected (k-GC) if the removal of less than k vertices does not affect the distances (lengths of the shortest paths) between any pair of the remaining vertices. As such graphs have important applications in robust system designs, we are interested in theminimumnumber of edges required tomake a k-GC graph of order n, and characterizing those minimum k-GC gr...
متن کامل(H, k) stable graphs with minimum size
Let us call a G (H, k) graph vertex stable if it contains a subgraph H ever after removing any of its k vertices. By Q(H, k) we will denote the minimum size of an (H, k) vertex stable graph. In this paper, we are interested in finding Q(C3, k), Q(C4, k), Q(K1,p, k) and Q(Ks, k).
متن کاملMinimum degree and pan-k-linked graphs
For a k-linked graph G and a vector E S of 2k distinct vertices of G, an E S-linkage is a set of k vertex-disjoint paths joining particular vertices of E S. Let T denote theminimum order of an E S-linkage in G. A graph G is said to be pan-k-linked if it is k-linked and for all vectors E S of 2k distinct vertices of G, there exists an E S-linkage of order t for all t such that T ≤ t ≤ |V (G)|. W...
متن کاملOn minimum (Kq, k) stable graphs
A graph G is a (Kq , k) vertex stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k vertices (k ≥ 0). We are interested by the (Kq , κ(q)) vertex stable graphs of minimum size where κ(q) is the maximum value for which for every nonnegative integer k < κ(q) the only (Kq , k) vertex stable graph of minimum size is Kq+k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90185-6